Extending Partial Representations of Circle Graphs
نویسندگان
چکیده
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some pre-drawn chords that represent an induced subgraph of G. The question is whether one can extend R′ to a representation R of the entire G, i.e., whether one can draw the remaining chords into a partially pre-drawn representation. Our main result is a polynomial-time algorithm for partial representation extension of circle graphs. To show this, we describe the structure of all representation a circle graph based on split decomposition. This can be of an independent interest.
منابع مشابه
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disks, triangles or in the bipartite case vertical and horizontal segments. It is known that such representations can be drawn in linear time, we here wonder whether it is as easy to decide whether a partial representation can be completed to a representation of the whole graph. We show that in each ...
متن کاملExtending Partial Representations of Function Graphs and Permutation Graphs
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0, 1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time. Function graphs generalize permutation graphs, which arise when all functions considered are linear. We focus on the problem of extending partial representations...
متن کاملExtending Partial Representations of Unit Circular-arc Graphs
The partial representation extension problem, introduced by Klav́ık et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs.
متن کاملExtending Cycles Locally to Hamilton Cycles
A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle S1 that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are 3-...
متن کاملExtending Partial Representations of Subclasses of Chordal Graphs
Chordal graphs are intersection graphs of subtrees of a tree T . We investigate the complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T ′ and some pre-drawn subtrees of T . It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (i.e, keeps the pre-drawn ...
متن کامل